Weight Distributions of Hamming Codes
نویسنده
چکیده
We derive a recursive formula determining the weight distribution of the [n = (qm − 1)/(q − 1), n − m, 3] Hamming code H(m, q), when (m, q−1) = 1. Here q is a prime power. The proof is based on Moisio’s idea of using Pless power moment identity together with exponential sum techniques.
منابع مشابه
Computation of Minimum Hamming Weight for Linear Codes
In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$ which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...
متن کاملOn the complete weight enumerators of some linear codes with a few weights
Linear codes with a few weights have important applications in authentication codes, secret sharing, consumer electronics, etc.. The determination of the parameters such as Hamming weight distributions and complete weight enumerators of linear codes are important research topics. In this paper, we consider some classes of linear codes with a few weights and determine the complete weight enumera...
متن کاملTranslates of Linear Codes Over
We give a method to compute the complete weight distribution of translates of linear codes over Z4. The method follows known ideas that have already been used successfully by others for Hamming weight distributions. For the particular case of quaternary Preparata codes, we obtain that the number of distinct complete weights for the dual Preparata codes and the number of distinct complete coset ...
متن کاملCoding Theory and Uniform Distributions
In the present paper we introduce and study finite point subsets of a special kind, called optimum distributions, in the n-dimensional unit cube. Such distributions are closely related with known (δ, s, n)-nets of low discrepancy. It turns out that optimum distributions have a rich combinatorial structure. Namely, we show that optimum distributions can be characterized completely as maximum dis...
متن کاملTwo classes of linear codes with defining sets derived from the kernel of norm or trace
Linear codes with a few weights have been widely investigated in recent years. In this paper, we mainly use Gauss sums to represent the Hamming weights of a class of q-ary linear codes under some certain conditions, where q is a power of a prime. The lower bound of its minimum Hamming distance is obtained. In some special cases, we evaluate the weight distributions of the linear codes by semi-p...
متن کاملPdmi Preprint — 27/1998 Coding Theory and Uniform Distributions
In the present paper we introduce and study finite point subsets of a special kind, called optimum distributions, in the n-dimensional unit cube. Such distributions are close related with known (δ, s, n)-nets of low discrepancy. It turns out that optimum distributions have a rich combinatorial structure. Namely, we show that optimum distributions can be characterized completely as maximum dista...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0710.1467 شماره
صفحات -
تاریخ انتشار 2007